A Method for Improving Data Delivery Efficiency in Vehicular Adhoc Networks

As vehicular networks become popular and many vehicles want to access data through a roadside unit. In this paper, there was a vehicle to roadside communication and we propose scheduling schemes for efficient delivery of data packets in vehicular adhoc network. On the basis of priority scheduling algorithm vehicles can download/upload the data from RSU. In this paper we can control the congestion and delay of data by assigning the priorities to the message. The process with highest priority is executed first and highest priority is assign to those processes which have the smallest data size and this scheme is the smallest data size first scheduling(SDF) . If the two processes having the same data size then we can assign the priority on the basis of first come first serve scheduling (FCFS). We can combine these two algorithms and the new algorithm D*A. is introduced. This algorithm is responsible for only sending the commercial messages and the safety messages will be send on the different channel. The emergency messages will be sending through control channel with help of EDF scheduling. This paper increases the efficiency and throughput of the process and decreases the turnaround time for the process.